A Quantum Protocol to Win the Graph Colouring Game on All Hadamard Graphs
نویسندگان
چکیده
David Avis Jun Hasegawa Yosuke Kikuchi and Yuuya Sasaki 1 Department of Computer Science, McGill University, 3480 University, Montreal, Quebec, Canada H3A 2A7, [email protected] 2 Department of Computer Science, Graduate School of Information Science and Technology, The University of Tokyo, 7-3-1 Hongo, Bunkyo-ku, Tokyo 113-0033, Japan {y sasaki, hasepyon}@is.s.u-tokyo.ac.jp 3 ERATO QCI Project, JST, Hongo White Building, Hongo 5-28-3, Bunkyo-ku, Tokyo 113-0033, Japan, [email protected]
منابع مشابه
Colouring game and generalized colouring game on graphs with cut-vertices
For k ≥ 2 we define a class of graphs Hk = {G : every block of G has at most k vertices}. The class Hk contains among other graphs forests, Husimi trees, line graphs of forests, cactus graphs. We consider the colouring game and the generalized colouring game on graphs from Hk.
متن کاملGeneralised game colouring of graphs
We consider the version of a colouring game introduced by Bodlaender [On the complexity of some colorings games, Internat. J. Found. Comput. Sci. 2 (1991) 133–147]. We combine the concepts: this game and the generalised colouring of graphs as follows. The two players are Alice and Bob and they play alternatively with Alice having the first move. Let be given a graph G and an ordered set of here...
متن کاملThe game chromatic number of graphs
Suppose G = (V, E) is a graph. The game chromatic number of G is defined through a two-person game: the colouring game. Given a graph G and a set C of colours, Alice and Bob, with Alice playing first, take turns in playing the game. Each play by either player consists of colouring an uncoloured vertex of G with a colour from C. Both players need to respect the rule that no adjacent vertices sho...
متن کاملThe role of quantum correlations in Cop and Robber game
We introduce and study quantized versions of Cop and Robber game. We achieve this by using graph-preserving quantum operations, which are the quantum analogues of stochastic operations preserving the graph. We provide the tight bound for the number of operations required to reach the given state. By extending them to the controlled operations, we define a quantum-controlled Cop and Robber game,...
متن کاملThe neighbour-sum-distinguishing edge-colouring game
Let γ : E(G) −→ N∗ be an edge colouring of a graph G and σγ : V (G) −→ N∗ the vertex colouring given by σγ(v) = ∑ e3v γ(e) for every v ∈ V (G). A neighbour-sumdistinguishing edge-colouring of G is an edge colouring γ such that for every edge uv in G, σγ(u) 6= σγ(v). The study of neighbour-sum-distinguishing edge-colouring of graphs was initiated by Karoński, Łuczak and Thomason [8]. They conjec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEICE Transactions
دوره 89-A شماره
صفحات -
تاریخ انتشار 2006